On Domain Decomposition Preconditioning in the Hierarchical P-version of the Nite Element Method
نویسنده
چکیده
The p-version nite element method for linear, second order elliptic equations in an arbitrary, suuciently smooth domain is studied in the framework of the Domain Decomposition (DD) method. Two types of square reference elements are used with the products of the integrated Legendre polynomials for coordinate functions. Estimates for the condition numbers are given, preconditioning of the problems arising on subdomains and of the Schur complement, the derivation of the DD pre-conditioner are all considered. We obtain several DD preconditioners for which the generalized condition numbers vary from O((log p) 3) to O(1). The paper consists of six sections. We give some preliminary results for the 1D case, condition number estimates and some inequalities for the 2D reference element. The preconditioning of the Schur complement is detailed for the 2D reference element, curvilinear nite elements are considered next, and the DD preconditioning of the entire stiiness matrix is introduced and analyzed. Some related reference elements using Chebyshev nodal bases on the boundary are introduced and analyzed with respect to the eeect on the preconditioner { the (log p) 3 factor may thus be removed.
منابع مشابه
TWO-LEVEL DOMAIN DECOMPOSITION PRECONDITIONING FOR THE p-VERSION FINITE ELEMENT METHOD IN THREE DIMENSIONS
This paper presents a exible approach to domain decomposition preconditioning for problems expressed in terms of local stiiness matrices of subdomains. Evaluation of the preconditioner requires fully parallelizable local computations and the solution of a global auxiliary problem with few variables per subdomain. Convergence factors can be bounded using properties of the local stiiness matrices...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملDecomposition and Fictitious Domains Methodsfor
Boundary value problems for elliptic second order equations in three-dimensional domains with piecewise smooth boundaries are considered. Discretization of the problem is performed using a conventional version of the nite element method with piecewise linear basis functions. The main purpose of the paper is the construction of a preconditioning operator for the resulting system of grid equation...
متن کاملPreconditioning of Boundary Value Problems Using Elementwise Schur Complements
Based on a particular node ordering and corresponding block decomposition of the matrix we analyse an e cient, algebraic multilevel preconditioner for the iterative solution of nite element discretizations of elliptic boundary value problems. Thereby an analysis of a new version of block-factorization preconditioning methods is presented. The approximate factorization requires an approximation ...
متن کاملRemarks on multilevel bases for divergence free nite elements
The connection between the multilevel factorization method re cently proposed by Sarin and Sameh for solving mixed discretizations of the Stokes equation using a divergence free nite element formula tion and hierarchical basis preconditioners is established For the D triangular Taylor Hood element a preconditioning method is proposed that could be useful in fractional step methods
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997